An Applicative Study of Zipf’s Law on Web Cache

نویسندگان

  • Lei Shi
  • Zhimin Gu
  • Lin Wei
  • Yun Shi
چکیده

Studying the Web access characteristics is the foundation of managing Web cache efficiently. In order to get the characteristics of the Web system, it is for sure that the time interval during which measurements are made should be large enough. Many studies have demonstrated that Zipf’s law governs many features of the WWW and can be used to describe the popularity of the Web objects. In this paper, we model the Web object popularity based on the Zipf-like law, discuss the stability concept of the Web system, which means how long the time interval will be so that the measured object popularities are reliable and calculate an upper bound for the minimum length of the request stream by the use of Zip-like law. Zipf-like law holds the promise of more effective design and use of Web cache resources.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploitation of different types of locality for Web caches

Object access distribution in the Web is governed by Zipf’s law, in general. This property leads to effective Web caches, which store the most popular objects and typically employ the LFU replacement policy, which achieves high, and often the highest, cache hit rates. However, Web cache design based only on Zipf’s law has two main disadvantages: (i) it does not exploit the temporal and spatial ...

متن کامل

1D-3 Web Caching and Zipf-like Distributions: Evidence and Implications

This paper addresses two unresolved issues about web caching. The first issue is whether web requests from a fixed user community are distributed according to Zipf’s law [22]. Several early studies have supported this claim [9], [5], [1] while other recent studies have suggested otherwise [16], [2]. The second issue relates to a number of recent studies on the characteristics of web proxy trace...

متن کامل

Optimizing the LRU Algorithm for Web Caching

We analyze a class of randomized Least-Recently-Used (LRU) cache replacement algorithms under the independent reference model with generalized Zipf’s law request probabilities. The randomization was recently proposed for Web caching as a mechanism that discriminates between different document sizes. In particular, a requested document that is not found in the cache either replaces a necessary n...

متن کامل

Cache replacement policies for P2P file sharing protocols

Peer-to-peer (P2P) file-sharing applications generate a large part of today's Internet traffic. The large volume of this traffic (thus high potential caching benefits) and the large cache sizes required (thus nontrivial costs associated with caching) only underline that efficient cache replacement policies are important in this case. File popularity in P2P file-sharing networks does not follow ...

متن کامل

Asymptotic Insensitivity of Least-Recently-Used Caching to Statistical Dependency

We investigate a widely popular Least-RecentlyUsed (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility for modeling strong statistical correlation, including the broadly reported long-range dependence in the World Wide Web page request patterns. When the frequency of requesting a page n is equal to the generalized Zipf’s law c/n, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006